翻訳と辞書 Words near each other ・ Sippy Downs, Queensland ・ Sippy Gill ・ Sippy Grewal ・ Sippy Pallippuram ・ Sipra ・ Sipra Bose ・ SIPRI Arms Transfers Database, Iraq 1973–1990 ・ SIPRNet ・ Siproeta ・ Siproeta epaphus ・ Siproeta stelenes ・ Sips ・ SIPS 1259-4336 ・ Sipsa ・ Sipservice ・ Sipser–Lautemann theorem ・ Sipsey ・ Sipsey Fork ・ Sipsey Fork of the Black Warrior River ・ Sipsey Fork, Mississippi ・ Sipsey River ・ Sipsey River (disambiguation) ・ Sipsey Wilderness ・ Sipsey, Alabama ・ Sipsi ・ Sipsmith ・ Sipson ・ Sipsu Gewog ・ SIPTA ・ Siptah Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Sipser–Lautemann theorem ： ウィキペディア英語版 Sipser–Lautemann theorem In computational complexity theory, the Sipser–Lautemann theorem or Sipser–Gács–Lautemann theorem states that bounded-error probabilistic polynomial (BPP) time is contained in the polynomial time hierarchy, and more specifically Σ2 ∩ Π2. In 1983, Michael Sipser showed that BPP is contained in the polynomial time hierarchy. Péter Gács showed that BPP is actually contained in Σ2 ∩ Π2. Clemens Lautemann contributed by giving a simple proof of BPP’s membership in Σ2 ∩ Π2, also in 1983. It is conjectured that in fact BPP=P, which is a much stronger statement than the Sipser–Lautemann theorem. ==Proof== Here we present the Lautemann's proof,〔 distinguishing the parts that are about containment in polynomial hierarchy and containment in Σ2. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Sipser–Lautemann theorem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.